Computability logic

Results: 552



#Item
61Math´ematiques `a rebours et un Lemme de K¨onig Faible de Type Ramsey Stage de Master 2 - MPRI mars - aoˆ ut 2012 Ludovic Patey ∗

Math´ematiques `a rebours et un Lemme de K¨onig Faible de Type Ramsey Stage de Master 2 - MPRI mars - aoˆ ut 2012 Ludovic Patey ∗

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2013-04-16 05:40:26
62Separating the Degree Spectra of Structures  Tyler John Markkanen, Ph.D. University of Connecticut, 2009  In computable model theory, mathematical structures are studied on the basis of

Separating the Degree Spectra of Structures Tyler John Markkanen, Ph.D. University of Connecticut, 2009 In computable model theory, mathematical structures are studied on the basis of

Add to Reading List

Source URL: www.math.uconn.edu

Language: English - Date: 2009-06-07 10:47:50
6315 > 17 JUNE  http://cca-net.de anfiteatro -1.A, Faculdade de Economia

15 > 17 JUNE http://cca-net.de anfiteatro -1.A, Faculdade de Economia

Add to Reading List

Source URL: cca-net.de

Language: English - Date: 2016-05-26 12:34:11
64Fluctuations, effective learnability and metastability in analysis Ulrich Kohlenbach, Pavol Safarik Department of Mathematics, Technische Universit¨ at Darmstadt, Schlossgartenstraße 7, 64289 Darmstadt, Germany

Fluctuations, effective learnability and metastability in analysis Ulrich Kohlenbach, Pavol Safarik Department of Mathematics, Technische Universit¨ at Darmstadt, Schlossgartenstraße 7, 64289 Darmstadt, Germany

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2013-05-10 05:50:36
65Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe–Universitt Robert–Mayer–Str. 6–10, 6000 F

Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe–Universitt Robert–Mayer–Str. 6–10, 6000 F

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2014-04-08 11:54:42
66RAMSEY’S THEOREM FOR SINGLETONS AND STRONG COMPUTABLE REDUCIBILITY DAMIR D. DZHAFAROV, LUDOVIC PATEY, REED SOLOMON, AND LINDA BROWN WESTRICK  Abstract. We answer a question posed by Hirschfeldt and Jockusch by showing

RAMSEY’S THEOREM FOR SINGLETONS AND STRONG COMPUTABLE REDUCIBILITY DAMIR D. DZHAFAROV, LUDOVIC PATEY, REED SOLOMON, AND LINDA BROWN WESTRICK Abstract. We answer a question posed by Hirschfeldt and Jockusch by showing

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-05-31 11:43:35
67On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 09:11:16
68OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-10-26 09:24:01
69Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540

Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 09:11:59
70Classical provability of uniform versions and intuitionistic provability Makoto Fujiwara∗ Mathematical Institute Tohoku University 6-3, Aramaki Aoba, Aoba-ku Sendai, Miyagi, Japan

Classical provability of uniform versions and intuitionistic provability Makoto Fujiwara∗ Mathematical Institute Tohoku University 6-3, Aramaki Aoba, Aoba-ku Sendai, Miyagi, Japan

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2013-08-17 07:52:06